Evacuation and a geometric construction for Fibonacci tableaux

نویسنده

  • Kendra Killpatrick
چکیده

Tableaux have long been used to study combinatorial properties of permutations and multiset permutations. Discovered independently by Robinson and Schensted and generalized by Knuth, the Robinson-Schensted correspondence has provided a fundamental tool for relating permutations to tableaux. In 1963, Schützenberger defined a process called evacuation on standard tableaux which gives a relationship between the pairs of tableaux (P,Q) resulting from the Schensted correspondence for a permutation and both the reverse and the complement of that permutation. Viennot gave a geometric construction for the Schensted correspondence and Fomin described a generalization of the correspondence which provides a bijection between permutations and pairs of chains in Young’s lattice. In 1975, Stanley defined a Fibonacci lattice and in 1988 he introduced the idea of a differential poset. Roby gave an insertion algorithm, analogous to the Schensted correspondence, for mapping a permutation to a pair of Fibonacci tableaux. The main results of this paper are to give an evacuation algorithm for the Fibonacci tableaux that is analogous to the evacuation algorithm on Young tableaux and to describe a geometric construction for the Fibonacci tableaux that is similar to Viennot’s geometric construction for Young tableaux.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Domino Fibonacci Tableaux

In 2001, Shimozono and White gave a description of the domino Schensted algorithm of Barbasch, Vogan, Garfinkle and van Leeuwen with the “color-to-spin” property, that is, the property that the total color of the permutation equals the sum of the spins of the domino tableaux. In this paper, we describe the poset of domino Fibonacci shapes, an isomorphic equivalent to Stanley’s Fibonacci lattice...

متن کامل

ar X iv : 0 70 9 . 09 71 v 1 [ m at h . C O ] 6 S ep 2 00 7 k - RIBBON FIBONACCI TABLEAUX

We extend the notion of k-ribbon tableaux to the Fibonacci lattice, a differential poset defined by R. Stanley in 1975. Using this notion, we describe an insertion algorithm that takes k-colored permutations to pairs of k-ribbon Fibonacci tableaux of the same shape, and we demonstrate a colorto-spin property, similar to that described by Shimozono and White for ribbon tableaux. We give an evacu...

متن کامل

Semi-primary Lattices and Tableau Algorithms

We develop the theory of semi-primary lattices, a class of modular lattices, including abelian subgroup lattices and invariant subspace lattices, in which an integer partition is assigned to every element and every interval. Flags in these lattices give rise to chains of partitions, which may be encoded as tableaux. In certain of these lattices, Steinberg and van Leeuwen respectively have shown...

متن کامل

Properties of the Robinson-schensted Correspondence for Oscillating and Skew Oscillating Tableaux

In this paper, we consider the Robinson-Schensted correspondence for oscillating tab-leaux and skew oscillating tableaux deened in 15] and 3]. First we give an analogue, for the oscillating tableaux, of the classical geometric construction of Viennot for standard tableaux ((16]). Then, we extend a construction of Sagan and Stanley ((10]), dealing with standard tableaux and skew tableaux, to ded...

متن کامل

Evacuation of Rectangular Standard Young Tableaux and Chip-firing

We elaborate upon a bijection discovered by Cools et al. in [CDPR10] between, on the one hand, rectangular standard Young tableaux, and, on the other hand, representatives, known as G-parking functions, of chip configurations on certain graphs modulo the chip-firing equivalence relation. We present an explcit formula for computing the G-parking function associated to a given tableau, and prove ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comb. Theory, Ser. A

دوره 110  شماره 

صفحات  -

تاریخ انتشار 2005